Limiting search cost distribution for the move-to-front rule with random request probabilities
نویسندگان
چکیده
Consider a list of n files whose popularities are random. These files are updated according to the move-tofront rule and we consider the induced Markov chain at equilibrium. We give the exact limiting distribution of the search-cost per item as n tends to infinity. Some examples are supplied.
منابع مشابه
Asymptotic Approximation of the Move-to-front Search Cost Distribution and Least-recently Used Caching Fault Probabilities
Consider a finite list of items n = 1;2; : : : ;N, that are requested according to an i.i.d. process. Each time an item is requested it is moved to the front of the list. The associated search cost CN for accessing an item is equal to its position before being moved. If the request distribution converges to a proper distribution as N→∞, then the stationary search cost CN converges in distributi...
متن کاملLimiting behavior of the search cost distribution for the move-to-front rule in the stable case
Abstract Move-to-front rule is a heuristic updating a list of n items according to requests. Items are required with unknown probabilities (or popularities). The induced Markov chain is known to be ergodic [4]. One main problem is the study of the distribution of the search cost defined as the position of the required item. Here we first establish the link between two recent papers [3,8] that b...
متن کاملHydrodynamic limit of move-to-front rules and search cost probabilities
We study a hydrodynamic limit approach to move-to-front rules, namely, a scaling limit as the number of items tends to infinity, of the joint distribution of jump rate and position of items. As an application of the limit formula, we present asymptotic formulas on search cost probability distributions, applicable for general jump rate distributions.
متن کاملOptimality of the Move-to-front Heuristic for Self-organizing Data Structures by Philippe Chassaing
In papers about self organizing data structures, it is often mentioned that the assumption of independence of successive requests of keys should be relaxed, and that the dependence assume the form of a locality phenomenon. In this setting, the move-to-front rule is considered to be of interest, but no optimality result concerning this rule has appeared. In this paper we assume that the sequence...
متن کاملOn the Markov chain for the move-to-root rule for binary search trees
The move-to-root (MTR) heuristic is a self-organizing rule which attempts to keep a binary search tree in near-optimal form. It is a tree analogue of the move-to-front (MTF) scheme for self-organizing lists. Both heuristics can be modeled as Markov chains. We show that the MTR chain can be derived by lumping the MTF chain and give exact formulas for the transition probabilities and stationary d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 34 شماره
صفحات -
تاریخ انتشار 2006